<!DOCTYPE html>


<html lang="zh-CN">


<head>
  <meta charset="utf-8" />
    
  <meta name="description" content="迎着朝阳的博客" />
  
  <meta name="viewport" content="width=device-width, initial-scale=1, maximum-scale=1" />
  <title>
    java备忘录-集合之栈和队列 |  迎着朝阳
  </title>
  <meta name="generator" content="hexo-theme-ayer">
  
  <link rel="shortcut icon" href="https://dxysun.com/static/yan.png" />
  
  
<link rel="stylesheet" href="/dist/main.css">

  
<link rel="stylesheet" href="https://cdn.jsdelivr.net/gh/Shen-Yu/cdn/css/remixicon.min.css">

  
<link rel="stylesheet" href="/css/custom.css">

  
  
<script src="https://cdn.jsdelivr.net/npm/pace-js@1.0.2/pace.min.js"></script>

  
  

  
<script>
var _hmt = _hmt || [];
(function() {
	var hm = document.createElement("script");
	hm.src = "https://hm.baidu.com/hm.js?aa994a8d65700b8835787dd39d079d7e";
	var s = document.getElementsByTagName("script")[0]; 
	s.parentNode.insertBefore(hm, s);
})();
</script>


</head>

</html>

<body>
  <div id="app">
    
      
    <main class="content on">
      <section class="outer">
  <article
  id="post-java-queueAndstack"
  class="article article-type-post"
  itemscope
  itemprop="blogPost"
  data-scroll-reveal
>
  <div class="article-inner">
    
    <header class="article-header">
       
<h1 class="article-title sea-center" style="border-left:0" itemprop="name">
  java备忘录-集合之栈和队列
</h1>
 

    </header>
     
    <div class="article-meta">
      <a href="/2017/10/03/java-queueAndstack/" class="article-date">
  <time datetime="2017-10-03T05:40:40.000Z" itemprop="datePublished">2017-10-03</time>
</a>   
<div class="word_count">
    <span class="post-time">
        <span class="post-meta-item-icon">
            <i class="ri-quill-pen-line"></i>
            <span class="post-meta-item-text"> 字数统计:</span>
            <span class="post-count">1.7k</span>
        </span>
    </span>

    <span class="post-time">
        &nbsp; | &nbsp;
        <span class="post-meta-item-icon">
            <i class="ri-book-open-line"></i>
            <span class="post-meta-item-text"> 阅读时长≈</span>
            <span class="post-count">7 分钟</span>
        </span>
    </span>
</div>
 
    </div>
      
    <div class="tocbot"></div>




  
    <div class="article-entry" itemprop="articleBody">
       
  <h3 id="栈Stack"><a href="#栈Stack" class="headerlink" title="栈Stack"></a>栈Stack</h3><p>栈是Vector的一个子类，它实现了一个标准的后进先出的栈。堆栈只定义了默认构造函数，用来创建一个空栈。 堆栈除了包括由Vector定义的所有方法，也定义了自己的一些方法。</p>
<figure class="highlight plain"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br></pre></td><td class="code"><pre><span class="line">boolean empty()  &#x2F;&#x2F;判断栈是否为空</span><br><span class="line">Object peek()    &#x2F;&#x2F;查看堆栈顶部的对象，但不从堆栈中移除它。</span><br><span class="line">Object pop()     &#x2F;&#x2F;移除堆栈顶部的对象，并作为此函数的值返回该对象。</span><br><span class="line">Object push(E element) &#x2F;&#x2F;把项压入堆栈顶部。</span><br><span class="line">int search(Object element)  &#x2F;&#x2F;返回对象在堆栈中的位置，以 1 为基数。</span><br></pre></td></tr></table></figure>
<p>下面的代码演示了栈的基本用法</p>
<a id="more"></a>
<figure class="highlight plain"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br></pre></td><td class="code"><pre><span class="line">public static void main(String[] args)</span><br><span class="line">&#123;</span><br><span class="line">     Stack&lt;String&gt; stack &#x3D; new Stack&lt;String&gt;();</span><br><span class="line"></span><br><span class="line">     stack.push(&quot;a&quot;);</span><br><span class="line">     stack.push(&quot;b&quot;);</span><br><span class="line">     stack.push(&quot;c&quot;);</span><br><span class="line">     stack.push(&quot;d&quot;);</span><br><span class="line">     System.out.println(&quot;stack中栈顶的元素: &quot;+ stack.peek());</span><br><span class="line">     System.out.println(&quot;stack中b的元素索引: &quot;+ stack.search(&quot;b&quot;)); </span><br><span class="line">     while(!stack.empty())&#123;</span><br><span class="line">         System.out.print( stack.pop() + &quot;   &quot; );</span><br><span class="line">     &#125;</span><br><span class="line"> &#125;</span><br></pre></td></tr></table></figure>
<p>输出结果为</p>
<figure class="highlight plain"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br></pre></td><td class="code"><pre><span class="line">stack中栈顶的元素: d</span><br><span class="line">stack中b的元素索引: 3</span><br><span class="line">d   c   b   a</span><br></pre></td></tr></table></figure>

<h3 id="队列-Queue"><a href="#队列-Queue" class="headerlink" title="队列 Queue"></a>队列 Queue</h3><p>队列是一种特殊的线性表，它只允许在表的前端进行删除操作，而在表的后端进行插入操作。LinkedList类实现了Queue接口，因此我们可以把LinkedList当成Queue来用。<br>Queue的主要方法如下</p>
<figure class="highlight plain"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br></pre></td><td class="code"><pre><span class="line">boolean add(Object element)    &#x2F;&#x2F;向队的末尾添加元素，如果队列已满，会抛出异常</span><br><span class="line">boolean offer(Object element)  &#x2F;&#x2F;相队的末尾添加元素，如果队列已满，返回false，推荐使用</span><br><span class="line"></span><br><span class="line">Object remove()                &#x2F;&#x2F;删除并返回队列头部的元素，如果队列为空抛出异常 </span><br><span class="line">Object poll()                  &#x2F;&#x2F;删除并返回队列头部的元素，如果队列为空返回null，推荐使用</span><br><span class="line"></span><br><span class="line">Object element()               &#x2F;&#x2F;返回队列头部的元素，如果队列为空抛出异常</span><br><span class="line">Object peek()                  &#x2F;&#x2F;返回队列头部的元素，如果队列为空返回null，推荐使用</span><br></pre></td></tr></table></figure>
<h4 id="一般队列-Queue"><a href="#一般队列-Queue" class="headerlink" title="一般队列 Queue"></a>一般队列 Queue</h4><p> 一般队列的示例代码如下<br> <figure class="highlight plain"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br></pre></td><td class="code"><pre><span class="line">public static void main(String[] args)</span><br><span class="line">&#123;</span><br><span class="line">	Queue&lt;String&gt; queueList &#x3D; new LinkedList&lt;&gt;();</span><br><span class="line">    &#x2F;&#x2F;使用offer方法</span><br><span class="line">    queueList.offer(&quot;a&quot;);</span><br><span class="line">    queueList.offer(&quot;b&quot;);</span><br><span class="line">    queueList.offer(&quot;c&quot;);</span><br><span class="line">    queueList.offer(&quot;d&quot;);</span><br><span class="line">    System.out.println(&quot;queueList peek 栈顶元素: &quot; + queueList.peek());</span><br><span class="line">    while(!queueList.isEmpty())</span><br><span class="line">    &#123;</span><br><span class="line">        System.out.print( queueList.poll() + &quot;   &quot; );</span><br><span class="line">    &#125;</span><br><span class="line">    System.out.println( &quot;\n队列为空 poll &quot; + queueList.poll());</span><br><span class="line">    System.out.println( &quot;队列为空 peek &quot; + queueList.peek());</span><br><span class="line">    &#x2F;&#x2F;使用add方法</span><br><span class="line">    queueList.add(&quot;a&quot;);</span><br><span class="line">    queueList.add(&quot;b&quot;);</span><br><span class="line">    queueList.add(&quot;c&quot;);</span><br><span class="line">    queueList.add(&quot;d&quot;);</span><br><span class="line">    System.out.println(&quot;queueList element 栈顶元素: &quot; + queueList.element());</span><br><span class="line">    while(!queueList.isEmpty())</span><br><span class="line">    &#123;</span><br><span class="line">        System.out.print( queueList.remove() + &quot;   &quot; );</span><br><span class="line">    &#125;</span><br><span class="line">    try &#123;</span><br><span class="line">        System.out.println( &quot;\n队列为空 remove &quot; + queueList.remove());</span><br><span class="line">    &#125;catch(NoSuchElementException e)&#123;</span><br><span class="line">        System.out.print(&quot;\n队列为空 remove  捕获异常   &quot; );</span><br><span class="line">    &#125;</span><br><span class="line">    try &#123;</span><br><span class="line">        System.out.println( &quot;\n队列为空 element &quot; + queueList.element());</span><br><span class="line">    &#125;catch(NoSuchElementException e)&#123;</span><br><span class="line">        System.out.print(&quot;\n队列为空 element 捕获异常   &quot; );</span><br><span class="line">    &#125;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure><br>输出结果为</p>
<figure class="highlight plain"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br></pre></td><td class="code"><pre><span class="line">queueList peek 栈顶元素: a</span><br><span class="line">a   b   c   d   </span><br><span class="line">队列为空 poll null</span><br><span class="line">队列为空 peek null</span><br><span class="line">queueList element 栈顶元素: a</span><br><span class="line">a   b   c   d   </span><br><span class="line">队列为空 remove  捕获异常   </span><br><span class="line">队列为空 element 捕获异常</span><br></pre></td></tr></table></figure>

<h4 id="双向队列-Deque"><a href="#双向队列-Deque" class="headerlink" title="双向队列 Deque"></a>双向队列 Deque</h4><p> Queue接口是单向队列，它有一个子接口Deque，表示双向队列。双向队列的特点是在队列的头部和尾部都可以添加或删除元素。它可以使用new ArrayDeque&lt;&gt;()来初始化，同时LinkedList实现了它的接口，也可使用new LinkedList&lt;&gt;()来初始化。<br> 主要方法如下</p>
<figure class="highlight plain"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br></pre></td><td class="code"><pre><span class="line">&#x2F;&#x2F;向队列的头部或者尾部添加元素，如果队列已满会抛出异常</span><br><span class="line">void addFirst(Object element)        </span><br><span class="line">void addLast(Object element)    </span><br><span class="line"></span><br><span class="line">&#x2F;&#x2F;向队列的头部或者尾部添加元素，如果队列已满返回false</span><br><span class="line">boolean offerFirst(Object element)   </span><br><span class="line">boolean offerLast(Object element)   </span><br><span class="line"></span><br><span class="line">&#x2F;&#x2F;从头部或尾部删除元素，如果队列为空抛出异常</span><br><span class="line">Object removeFirst()</span><br><span class="line">Object removeLast()</span><br><span class="line"></span><br><span class="line">&#x2F;&#x2F;从头部或尾部删除元素，如果队列为空返回nul</span><br><span class="line">Object pollFirst()</span><br><span class="line">Object pollLast()</span><br><span class="line"></span><br><span class="line">&#x2F;&#x2F;从队列头部或者尾部获取元素，如果队列为空抛出异常</span><br><span class="line">Object getFirst()</span><br><span class="line">Object getLast()</span><br><span class="line"></span><br><span class="line">&#x2F;&#x2F;从队列头部或者尾部获取元素，如果队列为空返回null</span><br><span class="line">Object peekFirst()</span><br><span class="line">Object peekLast()</span><br></pre></td></tr></table></figure>
<p>示例代码</p>
<figure class="highlight plain"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br></pre></td><td class="code"><pre><span class="line">public static void main(String[] args)</span><br><span class="line">&#123;</span><br><span class="line">	Deque&lt;String&gt; deque &#x3D; new ArrayDeque&lt;String&gt;();</span><br><span class="line"></span><br><span class="line">    deque.offer(&quot;b&quot;);</span><br><span class="line">    deque.offerFirst(&quot;a&quot;);</span><br><span class="line">    deque.offerLast(&quot;c&quot;);</span><br><span class="line">    deque.offer(&quot;d&quot;);</span><br><span class="line"></span><br><span class="line">    System.out.println(&quot;遍历双向队列 &quot; );</span><br><span class="line">    for(String atr : deque)</span><br><span class="line">    &#123;</span><br><span class="line">        System.out.print(atr + &quot;   &quot; );</span><br><span class="line">    &#125;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>
<p>输出结果</p>
<figure class="highlight plain"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line">遍历双向队列 </span><br><span class="line">a   b   c   d</span><br></pre></td></tr></table></figure>

<h4 id="优先级队列-PriorityQueue"><a href="#优先级队列-PriorityQueue" class="headerlink" title="优先级队列 PriorityQueue"></a>优先级队列 PriorityQueue</h4><p>优先级队列会按照排序的方式对队列中的元素进行排序和检索。因此加入到PriorityQueue中的对象必须实现Comparable接口，提供对元素排序时两个元素之间的比较规则。<br>示例代码</p>
<figure class="highlight plain"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br></pre></td><td class="code"><pre><span class="line">public static void main(String[] args)</span><br><span class="line">&#123;</span><br><span class="line">	Queue&lt;String&gt; priorityQueue &#x3D; new PriorityQueue&lt;String&gt;();</span><br><span class="line">    priorityQueue.add(&quot;c&quot;);</span><br><span class="line">    priorityQueue.add(&quot;a&quot;);</span><br><span class="line">    priorityQueue.add(&quot;d&quot;);</span><br><span class="line">    priorityQueue.add(&quot;b&quot;);</span><br><span class="line"></span><br><span class="line">    System.out.println(&quot;遍历优先级队列 &quot; );</span><br><span class="line">    for(String atr : priorityQueue)</span><br><span class="line">    &#123;</span><br><span class="line">        System.out.print(atr + &quot;   &quot; );</span><br><span class="line">    &#125;</span><br><span class="line">    System.out.println(&quot;\n依次删除优先级队列中的元素&quot;);</span><br><span class="line">    while(!priorityQueue.isEmpty())</span><br><span class="line">    &#123;</span><br><span class="line">        System.out.print(priorityQueue.poll() + &quot;   &quot; );</span><br><span class="line">    &#125;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>
<p>注意的是，用foreach语句遍历优先级队列时，获得元素并没有排序，而在通过poll()或者remove()方法删除元素时，该方法总会删除当前队列中最小的元素。<br>以上代码输出结果为</p>
<figure class="highlight plain"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br></pre></td><td class="code"><pre><span class="line">遍历优先级队列 </span><br><span class="line">a   b   d   c   </span><br><span class="line">依次删除优先级队列中的元素</span><br><span class="line">a   b   c   d</span><br></pre></td></tr></table></figure>

<h3 id="LinkedList"><a href="#LinkedList" class="headerlink" title="LinkedList"></a>LinkedList</h3><p>LinkedList在实现中采用了链表的数据结构，对顺序访问进行了优化，向Lsit中插入和删除元素的速度较快，随机访问则相对较慢。而且LinkedList实现了实现了较多的接口，它可以作为栈、队列和双向队列使用。<br>示例代码如下</p>
<figure class="highlight plain"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br></pre></td><td class="code"><pre><span class="line">public static void main(String[] args)</span><br><span class="line">&#123;</span><br><span class="line">	LinkedList&lt;String&gt; linkList &#x3D; new LinkedList&lt;&gt;();</span><br><span class="line">    System.out.println(&quot;linkList stack: &quot;);</span><br><span class="line"></span><br><span class="line">    linkList.push(&quot;a&quot;);</span><br><span class="line">    linkList.push(&quot;b&quot;);</span><br><span class="line">    linkList.push(&quot;c&quot;);</span><br><span class="line">    linkList.push(&quot;d&quot;);</span><br><span class="line">    while(!linkList.isEmpty())</span><br><span class="line">    &#123;</span><br><span class="line">        System.out.print( linkList.pop() + &quot;   &quot; );</span><br><span class="line">    &#125;</span><br><span class="line"></span><br><span class="line">    System.out.println();</span><br><span class="line">    System.out.println(&quot;linkList queue offer方法: &quot;);</span><br><span class="line">    linkList.offer(&quot;a&quot;);</span><br><span class="line">    linkList.offer(&quot;b&quot;);</span><br><span class="line">    linkList.offer(&quot;c&quot;);</span><br><span class="line">    linkList.offer(&quot;d&quot;);</span><br><span class="line">    while(!linkList.isEmpty())</span><br><span class="line">    &#123;</span><br><span class="line">        System.out.print( linkList.poll() + &quot;   &quot; );</span><br><span class="line">    &#125;</span><br><span class="line"></span><br><span class="line">    System.out.println();</span><br><span class="line">    System.out.println(&quot;linkList queue add方法: &quot;);</span><br><span class="line">    linkList.add(&quot;a&quot;);</span><br><span class="line">    linkList.add(&quot;b&quot;);</span><br><span class="line">    linkList.add(&quot;c&quot;);</span><br><span class="line">    linkList.add(&quot;d&quot;);</span><br><span class="line">    while(!linkList.isEmpty())</span><br><span class="line">    &#123;</span><br><span class="line">        System.out.print( linkList.remove() + &quot;   &quot; );</span><br><span class="line">    &#125;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>
<p>输出结果如下</p>
<figure class="highlight plain"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br></pre></td><td class="code"><pre><span class="line">linkList stack: </span><br><span class="line">d   c   b   a   </span><br><span class="line">linkList queue offer方法: </span><br><span class="line">a   b   c   d   </span><br><span class="line">linkList queue add方法: </span><br><span class="line">a   b   c   d</span><br></pre></td></tr></table></figure>
 
      <!-- reward -->
      
      <div id="reword-out">
        <div id="reward-btn">
          打赏
        </div>
      </div>
      
    </div>
    

    <!-- copyright -->
    
    <footer class="article-footer">
       
<div class="share-btn">
      <span class="share-sns share-outer">
        <i class="ri-share-forward-line"></i>
        分享
      </span>
      <div class="share-wrap">
        <i class="arrow"></i>
        <div class="share-icons">
          
          <a class="weibo share-sns" href="javascript:;" data-type="weibo">
            <i class="ri-weibo-fill"></i>
          </a>
          <a class="weixin share-sns wxFab" href="javascript:;" data-type="weixin">
            <i class="ri-wechat-fill"></i>
          </a>
          <a class="qq share-sns" href="javascript:;" data-type="qq">
            <i class="ri-qq-fill"></i>
          </a>
          <a class="douban share-sns" href="javascript:;" data-type="douban">
            <i class="ri-douban-line"></i>
          </a>
          <!-- <a class="qzone share-sns" href="javascript:;" data-type="qzone">
            <i class="icon icon-qzone"></i>
          </a> -->
          
          <a class="facebook share-sns" href="javascript:;" data-type="facebook">
            <i class="ri-facebook-circle-fill"></i>
          </a>
          <a class="twitter share-sns" href="javascript:;" data-type="twitter">
            <i class="ri-twitter-fill"></i>
          </a>
          <a class="google share-sns" href="javascript:;" data-type="google">
            <i class="ri-google-fill"></i>
          </a>
        </div>
      </div>
</div>

<div class="wx-share-modal">
    <a class="modal-close" href="javascript:;"><i class="ri-close-circle-line"></i></a>
    <p>扫一扫，分享到微信</p>
    <div class="wx-qrcode">
      <img src="//api.qrserver.com/v1/create-qr-code/?size=150x150&data=https://dxysun.com/2017/10/03/java-queueAndstack/" alt="微信分享二维码">
    </div>
</div>

<div id="share-mask"></div>  
  <ul class="article-tag-list" itemprop="keywords"><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/java/" rel="tag">java</a></li></ul>

    </footer>
  </div>

   
  <nav class="article-nav">
    
      <a href="/2017/10/04/pythonConda/" class="article-nav-link">
        <strong class="article-nav-caption">上一篇</strong>
        <div class="article-nav-title">
          
            Anaconda学习总结
          
        </div>
      </a>
    
    
      <a href="/2017/08/23/gitIgnore/" class="article-nav-link">
        <strong class="article-nav-caption">下一篇</strong>
        <div class="article-nav-title">git学习笔记之忽略文件</div>
      </a>
    
  </nav>

  
   
  
</article>

</section>
      <footer class="footer">
  <div class="outer">
    <ul>
      <li>
        Copyrights &copy;
        2015-2024
        <i class="ri-heart-fill heart_icon"></i> dxysun
      </li>
    </ul>
    <ul>
      <li>
        
        
        
        由 <a href="https://hexo.io" target="_blank">Hexo</a> 强力驱动
        <span class="division">|</span>
        主题 - <a href="https://github.com/Shen-Yu/hexo-theme-ayer" target="_blank">Ayer</a>
        
      </li>
    </ul>
    <ul>
      <li>
        
        
        <span>
  <span><i class="ri-user-3-fill"></i>访问人数:<span id="busuanzi_value_site_uv"></span></s>
  <span class="division">|</span>
  <span><i class="ri-eye-fill"></i>浏览次数:<span id="busuanzi_value_page_pv"></span></span>
</span>
        
      </li>
    </ul>
    <ul>
      
        <li>
          <a href="https://beian.miit.gov.cn" target="_black" rel="nofollow">豫ICP备17012675号-1</a>
        </li>
        
    </ul>
    <ul>
      
    </ul>
    <ul>
      <li>
        <!-- cnzz统计 -->
        
      </li>
    </ul>
  </div>
</footer>
      <div class="float_btns">
        <div class="totop" id="totop">
  <i class="ri-arrow-up-line"></i>
</div>

<div class="todark" id="todark">
  <i class="ri-moon-line"></i>
</div>

      </div>
    </main>
    <aside class="sidebar on">
      <button class="navbar-toggle"></button>
<nav class="navbar">
  
  <div class="logo">
    <a href="/"><img src="https://dxysun.com/static/logo.png" alt="迎着朝阳"></a>
  </div>
  
  <ul class="nav nav-main">
    
    <li class="nav-item">
      <a class="nav-item-link" href="/">主页</a>
    </li>
    
    <li class="nav-item">
      <a class="nav-item-link" href="/archives">归档</a>
    </li>
    
    <li class="nav-item">
      <a class="nav-item-link" href="/categories">分类</a>
    </li>
    
    <li class="nav-item">
      <a class="nav-item-link" href="/tags">标签</a>
    </li>
    
    <li class="nav-item">
      <a class="nav-item-link" href="/photos">相册</a>
    </li>
    
    <li class="nav-item">
      <a class="nav-item-link" href="/friends">友链</a>
    </li>
    
    <li class="nav-item">
      <a class="nav-item-link" href="/about">关于我</a>
    </li>
    
  </ul>
</nav>
<nav class="navbar navbar-bottom">
  <ul class="nav">
    <li class="nav-item">
      
      <a class="nav-item-link nav-item-search"  title="搜索">
        <i class="ri-search-line"></i>
      </a>
      
      
      <a class="nav-item-link" target="_blank" href="/atom.xml" title="RSS Feed">
        <i class="ri-rss-line"></i>
      </a>
      
    </li>
  </ul>
</nav>
<div class="search-form-wrap">
  <div class="local-search local-search-plugin">
  <input type="search" id="local-search-input" class="local-search-input" placeholder="Search...">
  <div id="local-search-result" class="local-search-result"></div>
</div>
</div>
    </aside>
    <script>
      if (window.matchMedia("(max-width: 768px)").matches) {
        document.querySelector('.content').classList.remove('on');
        document.querySelector('.sidebar').classList.remove('on');
      }
    </script>
    <div id="mask"></div>

<!-- #reward -->
<div id="reward">
  <span class="close"><i class="ri-close-line"></i></span>
  <p class="reward-p"><i class="ri-cup-line"></i>请我喝杯咖啡吧~</p>
  <div class="reward-box">
    
    <div class="reward-item">
      <img class="reward-img" src="https://tu.dxysun.com/alipay-20201219151322.jpg">
      <span class="reward-type">支付宝</span>
    </div>
    
    
    <div class="reward-item">
      <img class="reward-img" src="https://tu.dxysun.com/weixin-20201219151346.png">
      <span class="reward-type">微信</span>
    </div>
    
  </div>
</div>
    
<script src="/js/jquery-2.0.3.min.js"></script>


<script src="/js/lazyload.min.js"></script>

<!-- Tocbot -->


<script src="/js/tocbot.min.js"></script>

<script>
  tocbot.init({
    tocSelector: '.tocbot',
    contentSelector: '.article-entry',
    headingSelector: 'h1, h2, h3, h4, h5, h6',
    hasInnerContainers: true,
    scrollSmooth: true,
    scrollContainer: 'main',
    positionFixedSelector: '.tocbot',
    positionFixedClass: 'is-position-fixed',
    fixedSidebarOffset: 'auto'
  });
</script>

<script src="https://cdn.jsdelivr.net/npm/jquery-modal@0.9.2/jquery.modal.min.js"></script>
<link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/jquery-modal@0.9.2/jquery.modal.min.css">
<script src="https://cdn.jsdelivr.net/npm/justifiedGallery@3.7.0/dist/js/jquery.justifiedGallery.min.js"></script>

<script src="/dist/main.js"></script>

<!-- ImageViewer -->

<!-- Root element of PhotoSwipe. Must have class pswp. -->
<div class="pswp" tabindex="-1" role="dialog" aria-hidden="true">

    <!-- Background of PhotoSwipe. 
         It's a separate element as animating opacity is faster than rgba(). -->
    <div class="pswp__bg"></div>

    <!-- Slides wrapper with overflow:hidden. -->
    <div class="pswp__scroll-wrap">

        <!-- Container that holds slides. 
            PhotoSwipe keeps only 3 of them in the DOM to save memory.
            Don't modify these 3 pswp__item elements, data is added later on. -->
        <div class="pswp__container">
            <div class="pswp__item"></div>
            <div class="pswp__item"></div>
            <div class="pswp__item"></div>
        </div>

        <!-- Default (PhotoSwipeUI_Default) interface on top of sliding area. Can be changed. -->
        <div class="pswp__ui pswp__ui--hidden">

            <div class="pswp__top-bar">

                <!--  Controls are self-explanatory. Order can be changed. -->

                <div class="pswp__counter"></div>

                <button class="pswp__button pswp__button--close" title="Close (Esc)"></button>

                <button class="pswp__button pswp__button--share" style="display:none" title="Share"></button>

                <button class="pswp__button pswp__button--fs" title="Toggle fullscreen"></button>

                <button class="pswp__button pswp__button--zoom" title="Zoom in/out"></button>

                <!-- Preloader demo http://codepen.io/dimsemenov/pen/yyBWoR -->
                <!-- element will get class pswp__preloader--active when preloader is running -->
                <div class="pswp__preloader">
                    <div class="pswp__preloader__icn">
                        <div class="pswp__preloader__cut">
                            <div class="pswp__preloader__donut"></div>
                        </div>
                    </div>
                </div>
            </div>

            <div class="pswp__share-modal pswp__share-modal--hidden pswp__single-tap">
                <div class="pswp__share-tooltip"></div>
            </div>

            <button class="pswp__button pswp__button--arrow--left" title="Previous (arrow left)">
            </button>

            <button class="pswp__button pswp__button--arrow--right" title="Next (arrow right)">
            </button>

            <div class="pswp__caption">
                <div class="pswp__caption__center"></div>
            </div>

        </div>

    </div>

</div>

<link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/photoswipe@4.1.3/dist/photoswipe.min.css">
<link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/photoswipe@4.1.3/dist/default-skin/default-skin.min.css">
<script src="https://cdn.jsdelivr.net/npm/photoswipe@4.1.3/dist/photoswipe.min.js"></script>
<script src="https://cdn.jsdelivr.net/npm/photoswipe@4.1.3/dist/photoswipe-ui-default.min.js"></script>

<script>
    function viewer_init() {
        let pswpElement = document.querySelectorAll('.pswp')[0];
        let $imgArr = document.querySelectorAll(('.article-entry img:not(.reward-img)'))

        $imgArr.forEach(($em, i) => {
            $em.onclick = () => {
                // slider展开状态
                // todo: 这样不好，后面改成状态
                if (document.querySelector('.left-col.show')) return
                let items = []
                $imgArr.forEach(($em2, i2) => {
                    let img = $em2.getAttribute('data-idx', i2)
                    let src = $em2.getAttribute('data-target') || $em2.getAttribute('src')
                    let title = $em2.getAttribute('alt')
                    // 获得原图尺寸
                    const image = new Image()
                    image.src = src
                    items.push({
                        src: src,
                        w: image.width || $em2.width,
                        h: image.height || $em2.height,
                        title: title
                    })
                })
                var gallery = new PhotoSwipe(pswpElement, PhotoSwipeUI_Default, items, {
                    index: parseInt(i)
                });
                gallery.init()
            }
        })
    }
    viewer_init()
</script>

<!-- MathJax -->

<script type="text/x-mathjax-config">
  MathJax.Hub.Config({
      tex2jax: {
          inlineMath: [ ['$','$'], ["\\(","\\)"]  ],
          processEscapes: true,
          skipTags: ['script', 'noscript', 'style', 'textarea', 'pre', 'code']
      }
  });

  MathJax.Hub.Queue(function() {
      var all = MathJax.Hub.getAllJax(), i;
      for(i=0; i < all.length; i += 1) {
          all[i].SourceElement().parentNode.className += ' has-jax';
      }
  });
</script>

<script src="https://cdn.jsdelivr.net/npm/mathjax@2.7.6/unpacked/MathJax.js?config=TeX-AMS-MML_HTMLorMML"></script>
<script>
  var ayerConfig = {
    mathjax: true
  }
</script>

<!-- Katex -->

<!-- busuanzi  -->


<script src="/js/busuanzi-2.3.pure.min.js"></script>


<!-- ClickLove -->

<!-- ClickBoom1 -->

<!-- ClickBoom2 -->

<!-- CodeCopy -->


<link rel="stylesheet" href="/css/clipboard.css">

<script src="https://cdn.jsdelivr.net/npm/clipboard@2/dist/clipboard.min.js"></script>
<script>
  function wait(callback, seconds) {
    var timelag = null;
    timelag = window.setTimeout(callback, seconds);
  }
  !function (e, t, a) {
    var initCopyCode = function(){
      var copyHtml = '';
      copyHtml += '<button class="btn-copy" data-clipboard-snippet="">';
      copyHtml += '<i class="ri-file-copy-2-line"></i><span>COPY</span>';
      copyHtml += '</button>';
      $(".highlight .code pre").before(copyHtml);
      $(".article pre code").before(copyHtml);
      var clipboard = new ClipboardJS('.btn-copy', {
        target: function(trigger) {
          return trigger.nextElementSibling;
        }
      });
      clipboard.on('success', function(e) {
        let $btn = $(e.trigger);
        $btn.addClass('copied');
        let $icon = $($btn.find('i'));
        $icon.removeClass('ri-file-copy-2-line');
        $icon.addClass('ri-checkbox-circle-line');
        let $span = $($btn.find('span'));
        $span[0].innerText = 'COPIED';
        
        wait(function () { // 等待两秒钟后恢复
          $icon.removeClass('ri-checkbox-circle-line');
          $icon.addClass('ri-file-copy-2-line');
          $span[0].innerText = 'COPY';
        }, 2000);
      });
      clipboard.on('error', function(e) {
        e.clearSelection();
        let $btn = $(e.trigger);
        $btn.addClass('copy-failed');
        let $icon = $($btn.find('i'));
        $icon.removeClass('ri-file-copy-2-line');
        $icon.addClass('ri-time-line');
        let $span = $($btn.find('span'));
        $span[0].innerText = 'COPY FAILED';
        
        wait(function () { // 等待两秒钟后恢复
          $icon.removeClass('ri-time-line');
          $icon.addClass('ri-file-copy-2-line');
          $span[0].innerText = 'COPY';
        }, 2000);
      });
    }
    initCopyCode();
  }(window, document);
</script>


<!-- CanvasBackground -->


<script src="/js/dz.js"></script>



    
  </div>
</body>

</html>